Extended Timed Alternating Finite Automata: Revisited

In this paper, we continue to investigate timed alternating finite automata (TAFA), in particular we generalize the existing theory to the case of extended timed alternating finite automata (ETAFA). We define a framework extension of TAFA, study their power and properties. We develop an algebraic treatment of such ETAFA, along the lines of the algebraic treatment of systems of equations based on timed alternating finite automata. We present an equational language representation for ETAFA which parallels that of languages equations for TAFA. The power of these machines is discussed, as well as some of their fundamental properties. Moreover, we consider timed transitions and clock precisions, and discuss their interpretations in ETAFA.